#include <deque>
    front()
    back()
    push_front()
    push_back()
    pop_front()
    pop_back()
    empty()

#include <queue>
    front()
    push()
    pop()
    empty()

#include <utility> / <fstream>
    make_pair(,)
    first()
    second()

#include <vector>
    front()
    back()
    push_back()
    pop_back()
    clear()
    swap()
    empty()
    size()

#include <bitset> - se comporta ca un bool 

#include <queue>
- min-heap : priority_queue < pair<int,int> >
- max-heap : priority_queue < pair<int,int> , vector< pair<int,int> > 
, greater < pair<int ,int> > >
	* pop()
	* top()
	* push()
	* size()
	* empty()

